Two Processor Scheduling is in NC

WC prcsc~~t a parallcl dgorithm for tlic two processor scheduling problem. with iLrbit,rnry prccctl~~~cc constraints lluillg a polynorhd II~I~I~~HX of processors and for the problem luadc cxtcnsivc USC of randomization, our algorithm is complctcly dctcrkuistic and bnscd 011 rln intercsling dccomposi t i o n tcchuique. indcpcntlcnt rclcvarice for two more rcasous. And it is of It provides another exn~uplc for the apparent difference in complcxi ty betwcc.n decision and starch problems in the context of bt parallel conlputntion, and it gives an NC-algorithm for the matching problem ilr ccrtnin restricted cases. This work was sr~pporhl by ONII, conhct NO00 1.4-85-C-073 1 and NSF grant DCR835 1757.